from typing import List


class Solution:
    def minSideJumps(self, obstacles: List[int]) -> int:
        len_way = len(obstacles)
        # 转换成一个二维数组
        two_array = [[0 for i in range(len_way)] for j in range(3)]

        for i in range(obstacles):
            two_array[obstacles[i][i]] = 1
        dp =  [[0 for i in range(len_way)] for j in range(3)]



        all_route = list()
        def dfs(now,all_route,obstacles):
            if now == len_way:
                all_route.append(obstacles)



if __name__ == '__main__':
    obstacles = [0,1,2,3,0]

    solution = Solution()
    val = solution.minSideJumps(obstacles)
    print(val)